Fechar

@InCollection{LorenaLope:1996:DyLiHe,
               author = "Lorena, Luiz Antonio Nogueira and Lopes, F{\'a}bio Belo",
                title = "A dynamic list heuristic for 2D-cutting",
            booktitle = "System modelling and optimization: Proceedings of the Seventeenth 
                         IFIP TC7 Conference on System Modelling and Optimization, 1995",
            publisher = "Springer",
                 year = "1996",
               editor = "Dolezal, Jaroslav and Fidler, Jiri",
                pages = "481--488",
             keywords = "Cutting Stock, Heuristics, Best-first search, Tabu search.",
             abstract = "We present a new heuristic for the 2D-cutting problem, called 
                         Dynamic List Heuristic (DLH). The objective is to eliminate the 
                         combinatorial explosion of the all rectangle combination's type 
                         heuristics, maintaining their good results of reduced waste. 
                         Algorithm DLH uses a dynamic list of constructed patterns, 
                         included and deleted at convenient times. DLH is based on the A * 
                         approach, a best-first tree of candidate solutions, and the use of 
                         an auxiliary tabu list for alternate best patterns to avoid 
                         excessive repetition. The computational tests for some problems of 
                         the literature and many random generated problems, confirm good 
                         results using microcomputers.",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and {Instituto 
                         Nacional de Pesquisas Espaciais (INPE)}",
                  doi = "10.1007/978-0-387-34897-1_58",
                  url = "http://dx.doi.org/10.1007/978-0-387-34897-1_58",
                 isbn = "978-1-4757-6671-4  and {978-0-387-34897-1 (eBook)}",
             language = "en",
           targetfile = "lorena_dynamic.pdf",
        urlaccessdate = "29 abr. 2024"
}


Fechar